A Multi-objective Binary Cuckoo Search for Bi-criteria Knapsack Problem
نویسندگان
چکیده
منابع مشابه
Solving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملsolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
in this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. the optimistic and pessimistic situations were considered and associated deterministic models were yielded. numerical example has been supplied toillustrate the performance of proposed model. the results were prom...
متن کاملOne Rank Cuckoo Search Algorithm for Bi-Objective Load Dispatch Problem
This paper presents the application of a One Rank Cuckoo Search Algorithm (ORCSA) to bi-objective load dispatch (BOLD) problem where two objectives including fuel and emission are taken into consideration. ORCSA is an improvement of basic Cuckoo search algorithm (BCSA) where several modifications are carried out so as to improve the performance of the BCSA. The performance of the proposed ORCSA...
متن کاملDynamic programming algorithms for the bi-objective integer knapsack problem
This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...
متن کاملA Binary Cuckoo Search Algorithm for Graph Coloring Problem
The Graph Coloring Problem (GCP) is one of the most interesting, studied, and difficult combinatorial optimization problems. That is why several approaches were developed for solving this problem, including exact approaches, heuristic approaches, metaheuristics, and hybrid approaches. This paper tries to solve the graph coloring problem using a discrete binary version of cuckoo search algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information Engineering and Electronic Business
سال: 2013
ISSN: 2074-9023,2074-9031
DOI: 10.5815/ijieeb.2013.04.02